On a congruence property of elliptic curves
نویسنده
چکیده
Let d, α ∈ Z with d > 1. In this paper, we proved the following results about congruence properties of elliptic curves: (1) For elliptic curve E over the rational number field Q, if ♯Ẽp(Fp) ≡ α (mod d) hold for almost all primes p, then almost all supersingular primes p of E satisfy p ≡ α − 1 (mod d). In particular, α−1 is prime to d. Moreover, if φ(d) > 2, then E does not have complex multiplication. (2) There exists an elliptic curve E over Q such that ♯Ẽp(Fp) ≡ 0 (mod d) for almost all primes p if and only if d = 2, 3, 4, 5, 6, 7, 8, 9, 10, 12, 16. Depending on these results, we obtain solutions in many cases for an open question (see the text) presented recently by Kim, Koo and Park, e.g., this question in all cases (d, α) satisfying either d | α or gcd (α− 1, d) > 1 are solved completely. Some further questions and conjectures on congruence properties of elliptic curves are also presented and discussed.
منابع مشابه
ASPECTS OF COMPLEX MULTIPLICATION Contents
1. Preview 2 Complex multiplication on elliptic curves over C 2 Traces of singular moduli 3 Class field theory 3 The Kronecker limit formula and Kronecker’s solution of Pell’s equation 4 Application to Diophantine equations (Villegas) 4 L-series and CM modular forms 5 Other topics 6 2. Complex Multiplication on Elliptic Curves over C 6 Elliptic Curves over C 6 Elliptic functions 7 Complex multi...
متن کاملOn some congruence properties of elliptic curves
In this paper, as a result of a theorem of Serre on congruence properties, a complete solution is given for an open question (see the text) presented recently by Kim, Koo and Park. Some further questions and results on similar types of congruence properties of elliptic curves are also presented and discussed.
متن کاملEfficient elliptic curve cryptosystems
Elliptic curve cryptosystems (ECC) are new generations of public key cryptosystems that have a smaller key size for the same level of security. The exponentiation on elliptic curve is the most important operation in ECC, so when the ECC is put into practice, the major problem is how to enhance the speed of the exponentiation. It is thus of great interest to develop algorithms for exponentiation...
متن کاملComplete characterization of the Mordell-Weil group of some families of elliptic curves
The Mordell-Weil theorem states that the group of rational points on an elliptic curve over the rational numbers is a finitely generated abelian group. In our previous paper, H. Daghigh, and S. Didari, On the elliptic curves of the form $ y^2=x^3-3px$, Bull. Iranian Math. Soc. 40 (2014), no. 5, 1119--1133., using Selmer groups, we have shown that for a prime $p...
متن کاملAn Efficient Threshold Verifiable Multi-Secret Sharing Scheme Using Generalized Jacobian of Elliptic Curves
In a (t,n)-threshold secret sharing scheme, a secret s is distributed among n participants such that any group of t or more participants can reconstruct the secret together, but no group of fewer than t participants can do. In this paper, we propose a verifiable (t,n)-threshold multi-secret sharing scheme based on Shao and Cao, and the intractability of the elliptic curve discrete logar...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009